web dage inform manag waim intern workshop iwgd effici continu dduplic video detect distribut cach index effici subspac skylin comput network search trajectori locat effici studi trajectori search long attract challeng topic bloom interest applic spatial tempor databas work studi problem search trajectori locat context queri small set locat order target find connect trajectori bct databas bct connect design locat geograph convent trajectori search similar trajectori shape criteria sampl queri trajectori focu good connect provid trajectori queri locat queri benefit user applic trip plan work firstli defin similar function measur trajectori connect queri locat spatial distanc order constraint consid observ number queri locat small impract user input locat analyz feasibl gener purpos spatial index achiev effici bct search base simpl increment nn base algorithm iknn iknn effect prune refin trajectori devis lower bound upper bound similar contribut lie adapt depth nn algorithm basic iknn properli importantli ensur effici search effort memori usag depth studi adapt effici provid optim present acceler iknn algorithm final verifi effici algorithm extens experi mine dduplic graph cluster dbase rerank web video search result discoveri convoi trajectori databas mobil devic posit capabl continu prolifer data manag call trajectori databas captur histor movement popul move object import paper consid queri databas convoi convoi group object travel time specif paper formal concept convoi queri densiti base notion order captur group arbitrari extent shape convoi discoveri relev reallif applic throughput plan truck carpool vehicl extens research trajectori literatur appli retriev correctli exact convoi result set motiv develop effici algorithm convoi discoveri adopt wellknown filter refin framework filter step appli linesimplif techniqu trajectori establish distanc bound simplifi trajectori permit effici convoi discoveri simplifi trajectori miss actual convoi refin step candid convoi process obtain actual convoi comprehens empir studi offer insight properti paper propos demonstr propos effect effici real world trajectori data interact dduplic video retriev detect larg dscale video sequenc index impact idea trend effici inform retriev mobil peer dto dpeer network dimens dspecif search multimedia retriev dimens dspecif search multimedia retriev video annot system base categor keyword label hybrid retriev mechan vehicl dbase network process group nearest group queri onlin dduplic video clip detect retriev accur fast system instant advertis mobil peer dto dpeer network abstract explor benefit advertis instant locat awar commerci effect promot tradit medium tv program internet propos paper solut dissemin instant advertis user area interest mobil peer peer network applic scenario devis opportunist gossip model advertis propag spatial tempor constraint bandwidth comput resourc limit wireless environ optim mechan util distanc veloc inform provid reduc redund advertis messag user interest consid critic factor adjust advertis propag model adopt fm algorithm achiev effici count distinct user interest final studi perform solut simul ns compar naiv flood method approach achiev high qualiti deliveri rate reduc number messag order magnitud high ddimension index orient cluster represent multimedia databas content distribut mechan dht network content distribut mechan dht network monitor path nearest neighbor road network paper address problem monitor nearest neighbor dynam chang path road network destin user queri return nn respect shortest path connect destin user current locat list nearest candid refer come journei queri path nearest neighbor queri pnn user move follow shortest path queri path chang challeng monitor pnn arbitrarili move user dynam determin updat locat refresh pnn effici propos phase network expans bne algorithm monitor pnn shortest path search phase bne find shortest path destin candid set guarante includ pnn gener time verif phase heurist algorithm run examin candid exact distanc queri path achiev signific reduct number visit node monitor phase deal comput updat locat refresh pnn user movement determin network distanc costli process expans tree candid set carefulli maintain bne algorithm provid effici updat shortest path pnn result final conduct extens experi real road network show method achiev satisfactori perform multidimension scale princip compon analysi princip compon analysi pca ubiquit techniqu data analysi process base probabl model paper demonstr princip ax set observ data vector determin maximum likelihood estim paramet latent variabl model close relat factor analysi properti likelihood function give em algorithm estim princip subspac iter discuss illustr exampl advantag convei probabilist approach pca keyword princip compon analysi video sequenc index paper address problem detect shot subject interview new sequenc kind scene import reusabl inform new program previou paper present techniqu base priori knowledg edit techniqu new sequenc allow fast search new stori paper present shot descriptor techniqu improv previou search result simpl effici algorithm base inform contain consecut frame result provid prove valid approach hybrid inform retriev polici base cooper cach mobil network effect effici queri process video subsequ identif speed interact imag retriev instanc optim queri process spatial network local condens dimension reduct method imag retriev distribut dbase similar measur multi ddimension point set retriev applic convoi queri spatio dtempor databas hybrid predict model move object abstract exist predict method move object databas forecast locat accur queri time current time futur predict techniqu assum trajectori object movement repres mathemat formula motion function base recent movement object movement complic mathemat formula repres predict base object trajectori pattern power investig work main interest discov pattern paper present predict approach hybrid predict model estim object futur locat base pattern inform exist motion function object recent movement specif object trajectori pattern ad hoc form predict discov index access method effici queri process addit queri process techniqu provid accur result distant time predict queri present extens experi demonstr propos techniqu accur effici exist forecast scheme achiev effect multi dterm queri fast dht inform retriev local doccurr model fast approxim search structur databas discoveri convoi trajectori databas mobil devic posit capabl continu prolifer data manag call trajectori databas captur histor movement popul move object import paper consid queri databas convoi convoi group object travel time specif paper formal concept convoi queri densiti base notion order captur group arbitrari extent shape convoi discoveri relev reallif applic throughput plan truck carpool vehicl extens research trajectori literatur appli retriev correctli exact convoi result set motiv develop effici algorithm convoi discoveri adopt wellknown filter refin framework filter step appli linesimplif techniqu trajectori establish distanc bound simplifi trajectori permit effici convoi discoveri simplifi trajectori miss actual convoi refin step candid convoi process obtain actual convoi comprehens empir studi offer insight properti paper propos demonstr propos effect effici real world trajectori data challeng techniqu effect effici similar search larg video databas search relev visual inform base content featur larg databas interest changel topic drawn lot attent research commun industri paper overview investig effect effici video similar search briefli introduc techniqu develop specif task studi phd project video retriev larg collect segment video clip video subsequ identif long unseg stream propos method process type similar queri shown encourag perform incorpor prototyp system video search name uqlip demonstr market potenti commercialis multi dresolut surfac distanc model dnn queri process multi dresolut surfac distanc model dnn queri process statist summar content featur fast dduplic video detect effici similar search summar larg video databas explos video data video process technolog advanc quickli appli field advertis medic fast search video data import issu effect organ video data compact index practic distanc video comparison suitabl human percept metric tradit high dimension data structur util index video directli metric measur appli paper propos compact video represent base global summar video databas map digit string seri cluster id inter frame similar measur transform inter cluster comparison propos effici index strategi base sequenc decomposit reconstruct spatial index method util metric measur video similar search emploi optim tree invert list attach quickli identifi similar cluster locat potenti similar video final cluster base queri summar techniqu propos greatli reduc io cpu cost queri process batch map select estim batch dqueri base histogram parametr method histogram extens select estim approxim queri process workloadawar dynam histogram tune base queri feedback scan sampl underlai dataset systemat comprehens dynam histogram alloc bucket area skew data distribut user interest take long time warm larg number queri process histogram provid satisfactori coverag accuraci effect adapt workload pattern paper propos onlin queri schedul algorithm significantli reduc warm time dynam histogram parametr method propos remedi problem inaccur queri select estim area poor histogram coverag experiment result demonstr signific effect accuraci improv approach similar measur duplic video clip detect dual dimension reduct effici video similar search mine trajectori pattern hidden markov model dynam batch nearest neighbor search video retriev retriev similar databas video queri clip video typic repres sequenc highdimension featur vector queri video featur vector independ nearest neighbor nn search featur vector perform complet nn search similar comput singl video retriev involv search time nearbi featur vector video similar larg number expens random disk access expect repeatedli occur crucial affect queri perform batch nearest neighbor bnn search state singl oper perform batch individu nn search paper present approach effici high dimension bnn search call dynam queri order dqo advanc optim cpu cost observ overlap candid search space perviou queri reduc candid set succeed queri dqo aim progress find queri order common candid queri fulli util maxim reduc total number candid model candid set relationship candid overlap graph cog dqo iter select queri execut base estim prune power rest queri dynam updat cog extens experi show signific multi dsourc skylin queri process road network univers queensland trecvid search task paper describ particip trecvid part search task submit interact run type asr mt output inform run id uq dimension visual featur run id uq dimension visual featur retriev base evalu result benchmark video data observ signific differ run term measur util visual inform easi captur high level semant similar requir search topic year sophist approach multi modal fusion need improv system perform uqlip real dtime dduplic video clip detect system duplic video clip ndvc detect import problem wide rang applic tv broadcast monitor video copyright enforc content base video cluster annot larg databas ten thousand video clip thousand frame ndvc search perform real time addit inter frame similar spatial inform impact frame sequenc similar tempor inform search speed accuraci uqlip prototyp system onlin ndvc detect core uqlip compris complementari scheme detect ndvc bound coordin system bc compact represent model ignor tempor inform global summar video singl vector captur domin content content chang trend clip propos name frame symbol fra map clip sequenc symbol take tempor order sequenc context inform consider larg collect tv commerci uqlip demonstr feasibl perform real time ndvc detect high accuraci captur local inform shape represent adapt dynam dimension reduct method high ddimension index frontier www research develop apweb explor composit acoust featur effici music similar queri advanc web network technolog explor composit acoust featur effici music similar queri saverf effici relev feedback search surfac dnn queri process nn queri find nearest neighbor point point databas suffici measur object distanc euclidian distanc kei effici nn queri process fetch check distanc minimum number point databas applic vehicl movement road network rover anim movement terrain surfac distanc meaning valid movement path type nn queri focu effici queri process minim cost comput distanc environ data road network data terrain data order magnitud larger point data effici process nn queri base euclidian distanc road network distanc investig extens past paper investig problem surfac nn queri process distanc calcul shortest path terrain surfac problem challeng terrain data larg comput cost find shortest path high propos effici solut base multiresolut terrain model approach elimin costli process find shortest path rank object estim lower upper bound distanc multiresolut terrain model multiresolut terrain model effici visual queri process hierarch index structur effici similar search video retriev abstract rapid increas central video archiv distribut www video resourc content base video retriev gain import support applic effici content base video index address typic video repres sequenc frame due high dimension frame represent larg number frame video index introduc addit degre complex paper address problem content base video index propos effici solut call order va file ova file base va file ova file hierarch structur featur partit file slice small number slice access check nearest neighbor knn search effici handl insert vector ova file averag distanc vector approxim posit minim facilit search present effici approxim knn algorithm name order va low ova low base propos ova file ova low choos ova slice rank distanc center queri vector visit approxim select ova slice work approxim knn number ova slice control userdefin paramet adjust ova low trade queri cost result qualiti queri video clip consist multipl frame discuss extens experiment studi real video data set conduct result show method yield signific speed exist va file base method idist high queri result qualiti incorpor tempor correl video content method achiev effici perform index term video retriev index structur high dimension data order va file similar queri knn effici multifeatur queri process abstract advanc applic data multipl high dimension featur queri weight featur differ featur paper propos solut support effici queri process applic devis represent compactli captur featur compon compon vector reflect distanc rang minimum maximum valu featur respect refer point center space metric space compon bit signatur bit dimens obtain analyz featur descend energi histogram represent enabl level filter compon prune point share similar distanc rang bit signatur filter point base dimens relev featur represent facilit singl index structur speed process emploi classic tree purpos propos knn search algorithm exploit access order critic dimens highli select featur partial distanc prune search space effect extens experi real life synthet data set show propos solut offer signific perform advantag sequenti scan retriev method singl multipl va file index term multifeatur index queri process high dimension weight queri icicl semant dbase retriev system www imag imag increasingli embed html document www document www essenti provid rich sourc imag collect user queri interestingli semant imag typic surround text www imag search engin fail exploit imag semant give rise poor recal precis perform paper present icicl imag chainnet increment cluster engin prototyp system develop effect effici retriev www imag icicl distinguish featur emploi imag represent model call weight chainnet captur semant imag content weight chainnet base lexic chain repres semant imag nearbi text formula call list space model comput semant similar introduc weight chainnet icicl effect retriev imag base imag semant improv retriev effect propos relev feedback mechan icicl emploi increment cluster mechan icc increment cluster chainnet narrow search space retriev process relev partit icc imag similar semant cluster partit icc facilit increment updat adapt adjust number cluster cluster size conduct extens perform studi evalu icicl result show icicl effect effici weight chainnet icicl provid recal precis compar exist techniqu relev feedba index integr multipl featur www imag explor bit ddiffer approxim knn search high ddimension databas paper develop index structur support effici approxim nearest neighbor knn queri high dimension databas high dimension space comput cost distanc euclidean distanc point contribut domin portion queri respons time memori process reduc distanc comput propos structur bid bit differ answer approxim knn queri bid emploi bit repres featur vector point number bit differ prune point facilit real dataset typic skew enhanc bid mechan cluster cluster adapt bitcod dimension weight name bid extens experi conduct show propos method yield signific perform advantag exist index structur real life synthet high dimension dataset index text visual featur www imag effect index larg video sequenc databas rapid advanc video process technolog fast increment network bandwidth popular video content publish share made similar search indispens oper retriev video user interest video similar measur percentag similar frame share video sequenc frame typic repres highdimension featur vector high complex video content pose major challeng fast retriev effect compact video represent effici similar measur effici index compact represent paper propos number method achiev fast similar search larg video databas video sequenc summar small number cluster semant cach multiresolut spatial queri process mobil environ diagon order approach high ddimension knn process adapt quantiz high ddimension data effici knn process ldc enabl search partial distanc hyper ddimension space recent advanc research field multimedia bioinformat brought gener hyper dimension databas hundr thousand dimens hyperdimension databas pose signific problem exist high dimension index techniqu develop index databas commonli hundr dimens support cient queri retriev hyper dimension databas propos methodolog call local digit code ldc support nearest neighbor knn queri hyper dimension databas exist ubiquit indic tree ldc extract simpl bitmap represent call digit code dc point databas prune knn search perform dynam select subset bit dc base subsequ comparison perform expens oper involv comput norm distanc function hyper dimension data avoid extens experi conduct show methodolog er signific perform advantag exist index method real life synthet hyper dimension dataset effici semant dbase content search network abstract exist peer peer system support titl base search limit function compar todai search engin paper present design distribut inform share system support semant base content search relev document propos gener extens framework search similar document network framework base concept hierarch summari structur base framework develop effici document search system effect summar maintain document network granular final experiment studi conduct real prototyp larg scale network simul result show effect effici scalabl propos system index term content base similar search peer peer hierarch summari index adapt effici dimension reduct algorithm high ddimension index notori dimension curs phenomenon multi dimension index attempt scale high dimens approach overcom degrad perform respect increas dimens reduc dimension origin dataset construct index identifi correl dimens effect reduc challeng task paper present adapt multi level mahalanobisbas dimension reduct mmdr techniqu high dimension index mmdr techniqu notabl featur compar exist method discov ellipt cluster low dimension subspac data point axi system index singl tree techniqu highli scalabl term data size dimension extens perform studi real synthet dataset conduct result show techniqu achiev higher precis enabl queri process effici find similar imag quickli object shape give mean www imag find semant relat imag www 